A Heuristic Algorithm to Solve Toll Optimization Problems

نویسندگان

  • V. V. Kalashnikov
  • N. I. Kalashnykova
  • R. C. Herrera-Maldonado
چکیده

During the early years of industrial development, the production facilities were established near the consumers because the transportation was expensive, time-consuming, and risky. When transportation systems appeared, they allowed the producer to compete in distant markets, promoting economies of scale by increasing sales volume. Due to the complexity of products and globalization, supply and distribution chains have grown enormously, therefore, logistics costs have " rocketed up " sharply. According to the data from the IMF (International Monetary Fund), logistics costs represent 12% of gross national product, and they range from 4% to 30% of the sales at the enterprise level. Because of this growth, many countries have attached great importance to the development and modernization of the infrastructure to achieve greater participation in the global economy. There are organizations that deal with the development of communications and transportation infrastructure, building technologies to increase the coverage, quality and competitiveness of the infrastructure. In North America, administration of new (private) roads is commonly conceded to private companies, state governments, or financial institutions (banks, holdings, etc.), who set transportation tolls in order to retrieve money from the drivers. It has been recently noticed that under the concession model, there is less traffic flow using these tolled highways. One of the strategies taken to increase the use of toll roads is the regulation of tolls (pass rates). However, what are the appropriate criteria to assign these? Hence, this is the problem of assigning optimal tolls to the arcs of a multi-commodity transportation network. The toll optimization problem (TOP) can be formulated as a bilevel mathematical program where the upper level is managed by a firm (private or public) that raises revenues from tolls set on (some) arcs of the network, and the lower level is represented by a group of users traveling along the cheapest paths with respect to a generalized travel cost. The problem can be interpreted as finding a trade-off among tolls generating high revenues and those attractive for the users. The aim of the present work is to propose an algorithm based on the allowable ranges to stay optimal (ARSO) resulting from sensitivity analysis after solving the lower level problem. With this powerful tool, one can analyze possible changes in the coefficients of some variables in the objective function within these allowed ranges that do not affect the optimal solution. In addition to dealing with the allowable ranges, the proposed technique …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems

The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...

متن کامل

Introducing a new meta-heuristic algorithm based on See-See Partridge Chicks Optimization to solve dynamic optimization problems

The SSPCO (See-See Particle Chicks Optimization) is a type of swarm intelligence algorithm derived from the behavior of See-See Partridge. Although efficiency of this algorithm has been proven for solving static optimization problems, it has not yet been tested to solve dynamic optimization problems. Due to the nature of NP-Hard dynamic problems, this algorithm alone is not able to solve such o...

متن کامل

An Efficient Meta Heuristic Algorithm to Solve Economic Load Dispatch Problems

The Economic Load Dispatch (ELD) problems in power generation systems are to reduce the fuel cost by reducing the total cost for the generation of electric power. This paper presents an efficient Modified Firefly Algorithm (MFA), for solving ELD Problem. The main objective of the problems is to minimize the total fuel cost of the generating units having quadratic cost functions subjected to lim...

متن کامل

A Honey Bee Algorithm To Solve Quadratic Assignment Problem

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

متن کامل

Designing a Meta-Heuristic Algorithm Based on a Simple Seeking Logic

Nowadays, in majority of academic contexts, it has been tried to consider the highest possible level of similarities to the real world. Hence, most of the problems have complicated structures. Traditional methods for solving almost all of the mathematical and optimization problems are inefficient. As a result, meta-heuristic algorithms have been employed increasingly during recent years. In thi...

متن کامل

Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm

The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015